A nearly linear time algorithm for the half integral parity disjoint paths packing problem
نویسندگان
چکیده
We consider the following problem, which is called the half integral parity disjoint paths packing problem. Input: A graph G, k pair of vertices (s1, t1), (s2, t2), . . . , (sk, tk) in G (which are sometimes called terminals), and a parity li for each i with 1 ≤ i ≤ k, where li = 0 or 1. Output : Paths P1, . . . , Pk in G such that Pi joins si and ti for i = 1, 2, . . . , k and parity of length of the path Pi is li, i.e, if li = 0, then length of Pi is even, and if li = 1, then length of Pi is odd for i = 1, 2, . . . , k. In addition, each vertex is on at most two of these
منابع مشابه
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity
Mader’s disjoint S-paths problem is a common generalization of matching and Menger’s disjoint paths problems. Lovász (1980) suggested a polynomial-time algorithm for this problem through a reduction to matroid matching. A more direct reduction to the linear matroid parity problem was given later by Schrijver (2003), which leads to faster algorithms. As a generalization of Mader’s problem, Chudn...
متن کاملShortest Disjoint S-Paths Via Weighted Linear Matroid Parity
Mader’s disjoint S-paths problem unifies two generalizations of bipartite matching: (a) nonbipartite matching and (b) disjoint s–t paths. Lovász (1980, 1981) first proposed an efficient algorithm for this problem via a reduction to matroid matching, which also unifies two generalizations of bipartite matching: (a) non-bipartite matching and (c) matroid intersection. While the weighted versions ...
متن کاملSimple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs
In this paper we give a short survey on eecient algorithms for Steiner trees and paths packing problems in planar graphs. We particularly concentrate on recent results. The rst result is a linear-time algorithm for packing vertex-disjoint trees resp. paths within a planar graph, where the vertices to be connected lie on at most two diierent faces 26, 32]. This algorithm is based on a linear-tim...
متن کاملShortest (A+B)-path packing via hafnian
Björklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isolation lemma. In this paper, we consider the following generalization of the shortest two disjoint paths problem, and develop a similar algebraic algorithm. The shortest perfect (A + B)-path packing pr...
متن کاملAn (almost) Linear Time Algorithm For Odd Cycles Transversal∗
We consider the following problem, which is called the odd cycles transversal problem. Input: A graph G and an integer k. Output : A vertex set X ∈ V (G) with |X| ≤ k such that G−X is bipartite. We present an O(mα(m, n)) time algorithm for this problem for any fixed k, where n, m are the number of vertices and the number of edges, respectively, and the function α(m, n) is the inverse of the Ack...
متن کامل